The Prism Over the Middle-levels Graph is Hamiltonian
نویسندگان
چکیده
Let Bk be the bipartite graph defined by the subsets of {1, . . . , 2k + 1} of size k and k + 1. We prove that the prism over Bk is hamiltonian. We also show that Bk has a closed spanning 2-trail.
منابع مشابه
Prism-hamiltonicity of triangulations
The prism over a graph G is the Cartesian productG K2 of G with the complete graph K2. If the prism over G is hamiltonian, we say that G is prism-hamiltonian. We prove that triangulations of the plane, projective plane, torus, and Klein bottle are prism-hamiltonian. We additionally show that every 4-connected triangulation of a surface with sufficiently large representativity is prism-hamiltoni...
متن کاملHamilton cycles in prisms over graphs
The prism over a graph G is the Cartesian product G2K2 of G with the complete graph K2. If G is hamiltonian, then G2K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be a good measure how close a graph is to being hamiltonian. In this paper, we examine classical problems on hamiltonicity of graphs in the context of hamiltonian prisms.
متن کاملHamilton cycles in prisms
The prism over a graph G is the Cartesian product G2K2 of G with the complete graph K2. If G is hamiltonian, then G2K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be an interesting relaxation of being hamiltonian. In this paper, we examine classical problems on hamiltonicity of graphs in the context of having a hamiltonian prism. c © ???...
متن کامل$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Order
دوره 22 شماره
صفحات -
تاریخ انتشار 2005